feat(Computability/Languages): languages matching regular expressions are regular#720
Merged
Merged
Conversation
Added IsRegular.char and IsRegular.regex
Finished proof of IsRegular.char
chiyunhsu
changed the title
chenson2018
requested changes
Jul 16, 2026
chenson2018
enabled auto-merge
July 16, 2026 03:27
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
4 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Prove languages matching regular expressions are regular in IsRegular.regex.
The proof uses existing theorems IsRegular.add, IsRegular.mul, and IsRegular.kstar.
Prove remaining key ingredient that the language containing only the one character string is regular in IsRegular.char.
Implemented collaboratively by Brooke Gill and Chi-Yun Hsu